Quasi-Monte Carlo Integration on GRIDS: Using Blocked Substreams

نویسندگان

  • Heinz Hofbauer
  • Andreas Uhl
  • Peter Zinterhof
چکیده

The splitting of Quasi-Monte Carlo (QMC) point sequences into blocks or interleaved substreams has been suggested to raise the speed of distributed numerical integration and to lower to traffic on the network. The usefulness of this approach in GRID environments is discussed. After specifying requirements for using QMC techniques in GRID environments in general we review and evaluate the proposals made in literature so far. In numerical integration experiments we investigate the ability of blocking, and to a lower extend leaping, to deal with the special requirements in the GRID, with regard to the Sobol’, Halton, Faure, Niederreiter-Xing, and Zinterhof sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi Monte Carlo Integration in Grid Environments: Further Leaping Effects

The splitting of Quasi-Monte Carlo (QMC) point sequences into interleaved substreams has been suggested to raise the speed of distributed numerical integration and to lower the traffic on the network. The usefulness of this approach in GRID environments is discussed. After specifying requirements for using QMC techniques in GRID environments in general we review and evaluate the proposals made ...

متن کامل

Parameterization of Zinterhof Sequences for GRID-based QMC Integration

We have already investigated blocked and leaped substreams of the Zinterhof sequence for the use in the GRID. When comparing this sequence to others they have either the drawback of being computationally expensive (e.g. Niederreiter/Xing sequence) or have some kind of problematic defect (e.g. Sobol’ sequence). In contrast, the Zinterhof sequence behaves well and is computationally inexpensive. ...

متن کامل

Scenario Generation

Stability-based methods for scenario generation in stochastic programming arereviewed. In particular, we briefly discuss Monte Carlo sampling, Quasi–Monte Carlo methods,quadrature rules based on sparse grids, and optimal quantization. In addition, we provide someconvergence results based on recent developments in multivariate integration. The method ofoptimal scenario reduction ...

متن کامل

Quasi - Monte Carlo Methods in Computer Graphics

The problem of global illumination in computer graphics is described by a Fredholm integral equation of the second kind. Due to the complexity of this equation, Monte Carlo methods provide an efficient tool for the estimation of the solution. A new approach, using quasi-Monte Carlo integration, is introduced and compared to Monte Carlo integration. We discuss some theoretical aspects and give n...

متن کامل

Analysis of the Quasi-Monte Carlo Integration of the Rendering Equation

Quasi-Monte Carlo integration is said to be better than Monte-Carlo integration since its error bound can be in the order of O(N (1 )) instead of the O(N 0:5) probabilistic bound of classical Monte-Carlo integration if the integrand has finite variation. However, since in computer graphics the integrand of the rendering equation is usually discontinuous and thus has infinite variation, the supe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013